Approximating a Motorcycle Graph by a Straight Skeleton
نویسندگان
چکیده
We investigate how a straight skeleton can be used to approximate a motorcycle graph. We explain how to construct a planar straight-line graph G such that the straight skeleton of G reveals the motorcycle graph of M , for every given finite set M of motorcycles. An application of our construction is a proof of the Pcompleteness of the construction problem of straight skeletons of planar straight-line graphs and simple polygons with holes.
منابع مشابه
Faster Reductions for Straight Skeletons to Motorcycle Graphs
We give an algorithm that reduces the straight skeleton to the motorcycle graph in O(n log n) time for (weakly) simple polygons and O(n(log n) logm) time for a planar straight line graph with m connected components. The current fastest algorithms for computing motorcycle graphs are an O(n ) time algorithm for non-degenerate cases and O(n ) for degenerate cases. Together with our algorithm this ...
متن کاملA Fast Straight-Skeleton Algorithm Based on generalized Motorcycle Graphs
This paper deals with the fast computation of straight skeletons of planar straightline graphs (PSLGs) at an industrial-strength level. We discuss both the theoretical foundations of our algorithm and the engineering aspects of our implementation Bone. Our investigation starts with an analysis of the triangulation-based algorithm by Aichholzer and Aurenhammer and we prove the existence of flip-...
متن کاملA Straight Skeleton Approximating the Medial Axis
We propose the linear axis, a new skeleton for polygonal shapes. It is related to the medial axis and the straight skeleton, being the result of a wavefront propagation process. The wavefront is linear and propagates by translating edges at constant speed. The initial wavefront is an altered version of the original polygon: zero-length edges are added at reflex vertices. The linear axis is a su...
متن کاملSkeleton computation of orthogonal polyhedra
Skeletons are powerful geometric abstractions that provide useful representations for a number of geometric operations. The straight skeleton has a lower combinatorial complexity compared with the medial axis. Moreover, while the medial axis of a polyhedron is composed of quadric surfaces the straight skeleton just consist of planar faces. Although there exist several methods to compute the str...
متن کاملComputing straight skeletons of planar straight-line graphs based on motorcycle graphs
We present a simple algorithm for computing straight skeletons of planar straight-line graphs. We exploit the relation between motorcycle graphs and straight skeletons, and introduce a wavefront-propagation algorithm that circumvents the expensive search for the next split event. Our algorithm maintains the simplicity of the triangulation-based algorithm by Aichholzer and Aurenhammer but has a ...
متن کامل